| |
| description |
Tree-based reliable multicast protocols are known to provide better
scalability than the protocols based on pure sender- and
receiver-initiated schemes. However, previous analytical work that
has provided these results is based on a system model which assumes
reliable control message delivery and synchronized local clocks.
These assumptions are questionable simplifications, since they favor
protocols using multicasted negative acknowledgments with NAK
avoidance scheme. In this paper, we extend previous analysis by
taking into account control data loss and asynchronous local clocks.
We further analyze a new protocol class with particular importance,
the tree-based approach with aggregated acknowledgments. In contrast
to other approaches, this class provides reliability not only in
case of message loss but also in case of node failures. Our results
show that the additional overhead to cope with node failures is very
low and therefore acceptable for reliable multicast implementations.
|
| publisher |
Las Vegas, USA: IEEE Press
|
| type |
Text
|
| Article in Proceedings
|
| source |
In: IEEE (ed.): Proceedings of the 9th International Conference on
Computer Communciations and Networks (IEEE ICCCN 2000), pp. 250-257
|
| ftp://ftp.informatik.uni-stuttgart.de/pub/library/ncstrl.ustuttgart_fi/INPROC-2000-12/INPROC-2000-12.pdf
|
| contributor |
Verteilte Systeme (IPVR)
|
| format |
application/pdf
|
| 153545 Bytes
|
| subject |
Computer-Communication Networks (CR C.2)
|